On Recent Advances in Divisor Cordial Labeling of Graphs
نویسندگان
چکیده
An assignment of intergers to the vertices a graph subject certain constraints is called vertex labeling src=image/13424638_01.gif>. Different types techniques are used in field coding theory, cryptography, radar, missile guidance, src=image/13424638_02.gif>-ray crystallography etc. A DCL bijective function src=image/13424638_03.gif> from node set src=image/13424638_04.gif> src=image/13424638_05.gif> such that for each edge src=image/13424638_06.gif>, we allot 1 if src=image/13424638_07.gif> divides src=image/13424638_08.gif> or & 0 otherwise, then absolute difference between number edges having do not exceed 1, i.e., src=image/13424638_09.gif>. If permits DCL, it DCG. complete src=image/13424638_10.gif>, on src=image/13424638_11.gif> nodes which any 2 adjacent and lilly src=image/13424638_12.gif> formed by src=image/13424638_13.gif> joining src=image/13424638_14.gif>, src=image/13424638_15.gif> sharing common node. src=image/13424638_16.gif>, where src=image/13424638_17.gif> bipartite src=image/13424638_18.gif> path nodes. In this paper, propose an interesting conjecture concerning given src=image/13424638_01.gif>, besides, discussing general results src=image/13424638_10.gif>-related graphs. We also prove admits all src=image/13424638_15.gif>. Further, establish some src=image/13424638_12.gif>-related graphs context operations as duplication edge, node, extension switching degree splitting graph, barycentric subdivision
منابع مشابه
Further Results on Divisor Cordial Labeling
Abstract. A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2,... | |} V such that an edge uv is assigned the label 1 if ( ) | ( ) f u f v or ( ) | ( ) f v f u and the label 0 otherwise, then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a divisor cordial labeling is called a divisor cordial graph. ...
متن کاملRemainder Cordial Labeling of Graphs
In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...
متن کاملTotally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملPD-prime cordial labeling of graphs
vspace{0.2cm} Let $G$ be a graph and $f:V(G)rightarrow {1,2,3,.....left|V(G)right|}$ be a bijection. Let $p_{uv}=f(u)f(v)$ and\ $ d_{uv}= begin{cases} left[frac{f(u)}{f(v)}right] ~~if~~ f(u) geq f(v)\ \ left[frac{f(v)}{f(u)}right] ~~if~~ f(v) geq f(u)\ end{cases} $\ for all edge $uv in E(G)$. For each edge $uv$ assign the label $1$ if $gcd (p_{u...
متن کاملFurther results on total mean cordial labeling of graphs
A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics and Statistics
سال: 2022
ISSN: ['2332-2144', '2332-2071']
DOI: https://doi.org/10.13189/ms.2022.100111